翻訳と辞書
Words near each other
・ Derib
・ Deriba
・ Deriba Alemu
・ Deriba Caldera
・ Deriba Merga
・ Deribas
・ Deribasivska Street
・ Deric Bolton
・ Deric Holland-Martin
・ Deric Longden
・ Deric Ruttan
・ Deric Ruttan (album)
・ Deric Wan
・ Deric Washburn
・ Deric Yaussi
Deriche edge detector
・ Derichebourg
・ Derici
・ Derick Amadi
・ Derick Armstrong
・ Derick Ashe
・ Derick Baegert
・ Derick Banta House
・ Derick Brassard
・ Derick Brownell
・ Derick Burleson
・ Derick Cabrido
・ Derick Close
・ Derick Etwaroo
・ Derick Heathcoat-Amory, 1st Viscount Amory


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Deriche edge detector : ウィキペディア英語版
Deriche edge detector

Deriche edge detector is an edge detection operator developed by Rachid Deriche in 1987. It's a multistep algorithm used to obtain an optimal result of edge detection in a discrete two-dimensional image. This algorithm is based on John F. Canny's work related to the edge detection (Canny's edge detector) and his criteria for optimal edge detection:
* ''Detection quality'' – all existing edges should be marked and no false detection should occur.
* ''Accuracy'' - the marked edges should be as close to the edges in the real image as possible.
* ''Unambiguity'' - a given edge in the image should only be marked once. No multiple responses to one edge in the real image should occur.
For this reason, this algorithm is often referred to as Canny-Deriche detector.
== Differences between Canny and Deriche edge detector ==
Deriche edge detector, like Canny edge detector, consists of the following 4 steps:
# ''Smoothing''
# ''Calculation of magnitude and gradient direction''
# ''Non-maximum suppression''
# ''Hysteresis thresholding (using two thresholds)''
The essential difference is in the implementation of the first two steps of the algorithm. Unlike the Canny edge detector, Deriche edge detector uses the IIR filter in the form:
: f(x)=\frace^sin\omega x
The filter optimizes the Canny criteria. As is evident from the preceding formula, the most effective filter is obtained when the value of \omega approaches 0. Such filter then uses the formula:
: f(x)=Sxe^
The advantage of such a filter is that it can be adapted to the characteristics of the processed image using only one parameter. If the value of α is small (usually between 0.25 and 0.5), it results in better detection. On the other hand, better localization is achieved when the parameter has a higher value (around 2 or 3). For most of the normal cases parameter value of around 1 is recommended.
Using the IIR filter makes sense especially in cases where the processed image is noisy or a large amount of smoothing is required (which leads to large convolution kernel for FIR filter). In these cases, the Deriche detector has considerable advantage over the Canny detector, because it is able to process images in a short constant time independent of the desired amount of smoothing.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Deriche edge detector」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.